Asynchronous Inter-Level Forward-Checking for DisCSPs
نویسندگان
چکیده
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronous Forward Checking (AFC). The second algorithm, Asynchronous Inter-Level Forward-Checking (AILFC), is based on the AFC-ng algorithm and is performed on a pseudo-tree ordering of the constraint graph. AFC-ng and AILFC only need polynomial space. We compare the performance of these algorithms with other DisCSP algorithms on random DisCSPs in two kinds of communication environments: Fast communication and slow communication. Our experiments show that AFC-ng improves on AFC and that AILFC outperforms all compared algorithms in communication load.
منابع مشابه
Asynchronous Forward-Checking on DisCSPs
A new search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. Agents assign variables sequentially, but perform forward checking asynchronously. The asynchronous forward-checking algorithm (AFC) is a distributed search algorithm that keeps one consistent partial assignment at all times. Forward checking is performed by sending copies of the partial assi...
متن کاملSynchronous vs Asynchronous search on DisCSPs
Distributed constraint satisfaction problems (DisCSPs) are composed of agents, each holding its variables, that are connected by constraints to variables of other agents. There are two known measures of performance for distributed search the computational effort which represents the total search time and the number of messages sent which represents the network load. Due to the distributed natur...
متن کاملAsynchronous Backtracking for Asymmetric DisCSPs
Distributed constraint satisfaction problems (DisCSPs) with asymmetric constraints reflect the fact that agents may wish to retain their constraints private. The set of valid pairs of values of every binary constraint is split between the two constrained agents. An asynchronous backtracking algorithm for asymmetric DisCSPs is presented. The new algorithm is based on asynchronous backtracking (A...
متن کاملAsynchronous Search for Numeric DisCSPs
In Distributed CSPs (DisCSPs), agents may want to keep parts of their problem secret but accept to cooperate by exchanging proposals. Asynchronism in solving DisCSPs [1] increases flexibility, parallelism, and robustness. Enumerative algorithms apply for discrete problems with small domains. Our goal is to develop asynchronous algorithms that can deal with numeric constraints. Centralized techn...
متن کاملAsynchronous Forward-Bounding for Distributed Constraints Optimization
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchronously. The asynchronous forward-bounding algorithm (AFB) is a distributed optimization search algorithm that keeps one consistent partial assignment at all times. Forward bounding propagates the bounds on the cost o...
متن کامل